Complementary nil vertex edge dominating sets
نویسندگان
چکیده
منابع مشابه
Edge dominating sets and vertex covers
Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering, edge domination, and matching parameters is explored. In addition, the total vertex cover number is compared to the total domination number of ...
متن کاملTropical Dominating Sets in Vertex-Coloured Graphs
Given a vertex-coloured graph, a dominating set is said to be tropical if every colour of the graph appears at least once in the set. Here, we study minimum tropical dominating sets from structural and algorithmic points of view. First, we prove that the tropical dominating set problem is NP-complete even when restricted to a simple path. Then, we establish upper bounds related to various param...
متن کاملEfficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
Let G = (V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v ∈ V dominates its closed neighborhood N [v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v ∈ V , there is exactly one d ∈ D dominating v. An edge set M ⊆ E is an efficient edge dominating (e.e.d.) set for G if it is an efficient dominating set in the line graph...
متن کاملSmall Edge Dominating Sets of Regular Graphs
An edge dominating set F of a graph G is a subset of E(G) such that every edge in E(G) \ F is incident with at least one vertex that is an end-point of an edge in F . Edge dominating sets of small cardinality are of interest. We refer to the size of a smallest edge dominating set of a graph G as the edge domination number of G and denote this by β(G). In this paper we improve all current known ...
متن کاملGenerating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay
For an arbitrary undirected simple graph G with m edges, we give an algorithm with running time O(m|L|) to generate the set L of all minimal edge dominating sets of G. For bipartite graphs we obtain a better result; we show that their minimal edge dominating sets can be enumerated in time O(m|L|). In fact our results are stronger; both algorithms generate the next minimal edge dominating set wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proyecciones (Antofagasta)
سال: 2015
ISSN: 0716-0917
DOI: 10.4067/s0716-09172015000100001